NEONATAL HOST DEFENSES AGAINST K-1 AND NON K-1

On the Rational Recursive Sequence X_{N+1}=ƔX_{N-K}+(AX_N+BX_{N-K})⁄(CX_N-DX_{N-K})

On the family of Diophantine triples { k − 1 , k + 1 , 16 k 3 − 4 k }

It is proven that if k ≥ 2 is an integer and d is a positive integer such that the product of any two distinct elements of the set {k − 1, k + 1, 16k − 4k, d} increased by 1 is a perfect square, then d = 4k or d = 64k−48k+8k. Together with a recent result of Fujita, this shows that all Diophantine quadruples of the form {k − 1, k + 1, c, d} are regular.

Non - Reversible Golomb - Rice Code with k = 1 Reversible Golomb - Rice Code with k = 1

The International Telecommunications Union (ITU) recently adopted reversible variable length codes (RVLCs) for use in the emerging H.263+ video compression standard. As the name suggests, these codes can be decoded in two directions and can therefore be used by a decoder to enhance robustness in the presence of transmission bit errors. In addition, these RVLCs involve little or no eeciency loss...

Securing Circuits and Protocols against 1/poly(k) Tampering Rate

In this work we present an efficient compiler that converts any circuitC into one that is resilient to tampering with 1/ poly(k) fraction of the wires, where k is a security parameter independent of the size of the original circuit |C|. Our tampering model is similar to the one proposed by Ishai et al. (Eurocrypt, 2006) where a tampering adversary may tamper with any wire in the circuit (as lon...

Minimally (k, k-1)-edge-connected graphs

For an interger l > 1, the l-edge-connectivity λl(G) of G is defined to be the smallest number of edges whose removal leaves a graph with at least l components, if |V (G)| ≥ l; and λl(G) = |V (G)| if |V (G)| ≤ l. A graph G is (k, l)-edge-connected if the l-edge-connectivity of G is at least k. A sufficient and necessary condition for G to be minimally (k, k − 1)-edgeconnected is obtained in the...